Minimizing channel density with movable terminals
نویسندگان
چکیده
منابع مشابه
A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملAn OGCM with movable land–sea boundaries
An ocean general circulation model (OGCM) with wetting and drying (WAD) capabilities removes the vertical-wall coastal assumption and allows simultaneous modeling of open-ocean currents and water run-up (and run-down) across movable land–sea boundaries. This paper implements and tests such a WAD scheme for the Princeton Ocean Model (POM) in its most general three-dimensional setting with strati...
متن کاملBalancing 3D Models with Movable Masses
We present an algorithm to balance 3D printed models using movable embedded masses. As input, the user provides a 3D model together with the desired suspension, standing, and immersion objectives. Our technique then determines the placement and suitable sizing of a set of hollow capsules with embedded metallic spheres, leveraging the resulting multiple centers of mass to simultaneously satisfy ...
متن کاملServing Online Demands with Movable Centers
We study an online problem in which a set of mobile servers have to be moved in order to efficiently serve a set of requests that arrive in an online fashion. More formally, there is a set of n nodes and a set of k mobile servers that are placed at some of the nodes. Each node can potentially host several servers and the servers can be moved between the nodes. There are requests 1, 2, . . . tha...
متن کاملPlanning Among Movable Obstacles with Artificial Constraints
In this paper we present artificial constraints as a method for guiding heuristic search in the computationally challenging domain of motion planning among movable obstacles. The robot is permitted to manipulate unspecified obstacles in order to create space for a path. A plan is an ordered sequence of paths for robot motion and object manipulation. We show that under monotone assumptions, anti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1997
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf02522820